#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(long n)
{
   if(n == 1) return false;
    for(long i = 2; i<=(int)sqrt(n); i++)
    {
        if(n%i == 0)
            return false;
    }
    return true;
}

int main()
{
    long N;
    cin>>N;
    for(long p = 2; p<N; p++)
    {
        if(isPrime(p) && isPrime(N-p))
        {
            cout<<N <<" = "<<p<<" + "<<N-p;
            break;
        }
    
    }
    
}